منابع مشابه
BCS Interpreting Message Flow
We give a semantics for Message Flow Graphs (MFGs), which play the role for interprocess communication that Program Dependence Graphs play for control ow in parallel processes. MFGs have been used to analyse parallel code, and are closely related to Message Sequence Charts and Time Sequence Diagrams in telecommunications systems. Our requirements are rstly, to determine unam-biguously exactly w...
متن کاملFour issues concerning the semantics of Message Flow Graphs
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence Chart (MSC) is ITU Standard Z.120. We require that a system described by an MFG has global states with respect to its message-passing behavior, with transitions between these states eeected by atomic message-passing a...
متن کاملStudent Teachers Interpreting Media Graphs
The official inclusion of the teaching of graphing in school curricula has motivated increasing research and innovative pedagogical strategies such as the use of media graphs in school contexts. However, only a few studies have investigated knowledge about graphing among those who will teach this curricular content. We discuss aspects of the interpretation of media graphs among primary school s...
متن کامل12 . Message Flow Analysis
Message management systems with facilities for the automatic processing of messages can exhibit anomalous behaviour such as infinite loops and deadlock. In this paper we present some methods for analyzing the behaviour of these systems by generating expressions of message flowf rom the procedure specifications. Message domains are partitioned into state spaces, and procedures can be interpreted...
متن کاملControllable-Choice Message Sequence Graphs
We focus on the realizability problem of Message Sequence Graphs (MSG), i.e. the problem whether a given MSG specification is correctly distributable among parallel components communicating via messages. This fundamental problem of MSG is known to be undecidable. We introduce a well motivated restricted class of MSG, so called controllable-choice MSG, and show that all its models are realizable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 1995
ISSN: 0934-5043,1433-299X
DOI: 10.1007/bf01211629